منابع مشابه
The Network Coding based on Marked Packets
In N–sinks and N-sources network, if the number of the received packets from the source is less than the number of the required packets to solve the linear independence relationship in the sink side, then the sink node will not be able to retrieve the event correctly. Therefore, in this paper, a new approach was designed to enhance the total number of meaningful packets (the true packets that d...
متن کاملNetwork Coding Based Packets Queue Operation for Wireless Ad Hoc Networks
Wireless communication is a technology that simplify the daily life and to narrow the distance between people. Unfortunately throughput limitation of wireless networks is limiting the performance of wireless networks. In order to increase the throughput of the wireless network, network coding has been proposed to increase the throughput of network. Unlike conventional store-and-forward method, ...
متن کاملMarked Temporal Dynamics Modeling Based on Recurrent Neural Network
We are now witnessing the increasing availability of event stream data, i.e., a sequence of events with each event typically being denoted by the time it occurs and its mark information (e.g., event type). A fundamental problem is to model and predict such kind of marked temporal dynamics, i.e., when the next event will take place and what its mark will be. Existing methods either predict only ...
متن کاملthe role of task-based techniques on the acquisition of english language structures by the intermediate efl students
this study examines the effetivenss of task-based activities in helping students learn english language structures for a better communication. initially, a michigan test was administered to the two groups of 52 students majoring in english at the allameh ghotb -e- ravandi university to ensure their homogeneity. the students scores on the grammar part of this test were also regarded as their pre...
15 صفحه اولNetwork Coding Based on Chinese Remainder Theorem
Random linear network code has to sacrifice part of bandwidth to transfer the coding vectors, thus a head of size k log |T | is appended to each packet. We present a distributed random network coding approach based on the Chinese remainder theorem for general multicast networks. It uses a couple of modulus as the head, thus reduces the size of head to O(log k). This makes it more suitable for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/13398-1046